Continuous Patrolling Games

Continuous Patrolling Sometimes it is necessary to have a Patroller (on foot, in car, or maybe drone) move around network so as prevent an intruder (the Attacker) from infiltrating otherwise ruining the operation. The “attack” could be, for example, removing painting Louvre, crossing border, planting bomb. first possibility take place at only discrete set of points on network, say, nodes. However, last two types attack anywhere. latter continuous problem has been modelled game by Steve Alpern, Thuy Bui, Thomas Lidbetter, and Katerina Papadaki article “Continuous Games.” Attacker decides when where duration specified problem), whereas chooses unit speed path, possibly periodic. If passes attacked point while going on, he wins game, thwarted. Otherwise successful, game. authors determine optimal strategies both players many classes networks find good that work any network. These ideas be adapted real-life patrolling problems networks.